A novel approach to study realistic navigations on networks

We consider navigation or search schemes on networks which are realistic in the sense that not all search chains can be completed. We show that the quantity $\mu = \rho/s_d$, where $s_d$ is the average dynamic shortest distance and $\rho$ the success rate of completion of a search, is a consistent measure for the quality of a search strategy. Taking the example of realistic searches on scale-free networks, we find that $\mu$ scales with the system size $N$ as $N^{-\delta}$, where $\delta$ decreases as the searching strategy is improved. This measure is also shown to be sensitive to the distintinguishing characteristics of networks. In this new approach, a dynamic small world (DSW) effect is said to exist when $\delta \approx 0$. We show that such a DSW indeed exists in social networks in which the linking probability is dependent on social distances.Comment: Text revised, references added; accepted version in Journal of Statistical Mechanic

Is the New Resonance Spin 0 or 2? Taking a Step Forward in the Higgs Boson Discovery

The observation of a new boson of mass \sim 125\gev at the CERN LHC may finally have revealed the existence of a Higgs boson. Now we have the opportunity to scrutinize its properties, determining its quantum numbers and couplings to the standard model particles, in order to confirm or not its discovery. We show that by the end of the 8 TeV run, combining the entire data sets of ATLAS and CMS, it will be possible to discriminate between the following discovery alternatives: a scalar $J^P=0^+$ or a tensor $J^P=2^+$ particle with minimal couplings to photons, at a $5\sigma$ statistical confidence level at least, using only diphotons events. Our results are based on the calculation of a center-edge asymmetry measure of the reconstructed {\it sPlot} scattering polar angle of the diphotons. The results based on asymmetries are shown to be rather robust against systematic uncertainties with comparable discrimination power to a log likelihood ratio statistic.Comment: 11 pages, 6 figures, 1 table. References added, minor typos correcte

MEDUSA - New Model of Internet Topology Using k-shell Decomposition

The k-shell decomposition of a random graph provides a different and more insightful separation of the roles of the different nodes in such a graph than does the usual analysis in terms of node degrees. We develop this approach in order to analyze the Internet's structure at a coarse level, that of the "Autonomous Systems" or ASes, the subnetworks out of which the Internet is assembled. We employ new data from DIMES (see http://www.netdimes.org), a distributed agent-based mapping effort which at present has attracted over 3800 volunteers running more than 7300 DIMES clients in over 85 countries. We combine this data with the AS graph information available from the RouteViews project at Univ. Oregon, and have obtained an Internet map with far more detail than any previous effort. The data suggests a new picture of the AS-graph structure, which distinguishes a relatively large, redundantly connected core of nearly 100 ASes and two components that flow data in and out from this core. One component is fractally interconnected through peer links; the second makes direct connections to the core only. The model which results has superficial similarities with and important differences from the "Jellyfish" structure proposed by Tauro et al., so we call it a "Medusa." We plan to use this picture as a framework for measuring and extrapolating changes in the Internet's physical structure. Our k-shell analysis may also be relevant for estimating the function of nodes in the "scale-free" graphs extracted from other naturally-occurring processes.Comment: 24 pages, 17 figure

From non-Brownian Functionals to a Fractional Schr\"odinger Equation

We derive backward and forward fractional Schr\"odinger type of equations for the distribution of functionals of the path of a particle undergoing anomalous diffusion. Fractional substantial derivatives introduced by Friedrich and co-workers [PRL {\bf 96}, 230601 (2006)] provide the correct fractional framework for the problem at hand. In the limit of normal diffusion we recover the Feynman-Kac treatment of Brownian functionals. For applications, we calculate the distribution of occupation times in half space and show how statistics of anomalous functionals is related to weak ergodicity breaking.Comment: 5 page

Transport in networks with multiple sources and sinks

We investigate the electrical current and flow (number of parallel paths) between two sets of n sources and n sinks in complex networks. We derive analytical formulas for the average current and flow as a function of n. We show that for small n, increasing n improves the total transport in the network, while for large n bottlenecks begin to form. For the case of flow, this leads to an optimal n* above which the transport is less efficient. For current, the typical decrease in the length of the connecting paths for large n compensates for the effect of the bottlenecks. We also derive an expression for the average flow as a function of n under the common limitation that transport takes place between specific pairs of sources and sinks

Data Citizenship: Data Literacies to Challenge Power Imbalance Between Society and “Big Tech”

We argue here that data literacies and capabilities are an integral part of data justice. Based on focus group data collected as part of a 3-year empirical project research project, we find that citizens remain unaware of key aspects of the digital ecosystem, which exacerbate the power imbalance between big technology (data processors) companies and citizens (data subjects). Citizens feel concerned about the way it is operating, they do not feel confident enough to be able to address that. We find that “networks of literacy” among friends, colleagues, and trusted organizations are crucial for citizens’ capabilities. These networks influence citizens’ ability to convert their available means into capabilities to support civic engagement and their communities

Search in Complex Networks : a New Method of Naming

We suggest a method for routing when the source does not posses full information about the shortest path to the destination. The method is particularly useful for scale-free networks, and exploits its unique characteristics. By assigning new (short) names to nodes (aka labelling) we are able to reduce significantly the memory requirement at the routers, yet we succeed in routing with high probability through paths very close in distance to the shortest ones.Comment: 5 pages, 4 figure

Pseudospin-Resolved Transport Spectroscopy of the Kondo Effect in a Double Quantum Dot

We report measurements of the Kondo effect in a double quantum dot (DQD), where the orbital states act as pseudospin states whose degeneracy contributes to Kondo screening. Standard transport spectroscopy as a function of the bias voltage on both dots shows a zero-bias peak in conductance, analogous to that observed for spin Kondo in single dots. Breaking the orbital degeneracy splits the Kondo resonance in the tunneling density of states above and below the Fermi energy of the leads, with the resonances having different pseudospin character. Using pseudospin-resolved spectroscopy, we demonstrate the pseudospin character by observing a Kondo peak at only one sign of the bias voltage. We show that even when the pseudospin states have very different tunnel rates to the leads, a Kondo temperature can be consistently defined for the DQD system.Comment: Text and supplementary information. Text: 4 pages, 5 figures. Supplementary information: 4 pages, 4 figure

Extended navigability of small world networks: exact results and new insights

Navigability of networks, that is the ability to find any given destination vertex starting from any other vertex, is crucial to their usefulness. In 2000 Kleinberg showed that optimal navigability could be achieved in small-world networks provided that a special recipe was used to establish long range connections, and that a greedy algorithm, that ensures that the destination will be reached, is used. Here we provide an exact solution for the asymptotic behavior of such a greedy algorithm as a function of the system's parameters. Our solution enables us to show that the original claim that only a very special construction is optimal can be relaxed depending on further criteria, such as, for example, cost minimization, that must be satisfied.Comment: Presented at the BCNet Workshop in Barcelona on December 12 2008; submitted to PR

The evolution of interdisciplinarity in physics research

Science, being a social enterprise, is subject to fragmentation into groups that focus on specialized areas or topics. Often new advances occur through cross-fertilization of ideas between sub-fields that otherwise have little overlap as they study dissimilar phenomena using different techniques. Thus to explore the nature and dynamics of scientific progress one needs to consider the large-scale organization and interactions between different subject areas. Here, we study the relationships between the sub-fields of Physics using the Physics and Astronomy Classification Scheme (PACS) codes employed for self-categorization of articles published over the past 25 years (1985-2009). We observe a clear trend towards increasing interactions between the different sub-fields. The network of sub-fields also exhibits core-periphery organization, the nucleus being dominated by Condensed Matter and General Physics. However, over time Interdisciplinary Physics is steadily increasing its share in the network core, reflecting a shift in the overall trend of Physics research.Comment: Published version, 10 pages, 8 figures + Supplementary Informatio